Logic, Complexity, and Games
نویسنده
چکیده
In this talk, I will discuss an approach to the P = NP question via the correspondence between logic and complexity. The main focus will be on the possible use of Ehrenfeucht-Fraı̈ssé games.
منابع مشابه
A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملOnce Upon a Time in the West Determinacy, definability, and complexity of path games⋆
We study determinacy, definability and complexity issues of path games on finite and infinite graphs. Compared to the usual format of infinite games on graphs (such as GaleStewart games) we consider here a different variant where the players select in each move a path of arbitrary finite length, rather than just an edge. The outcome of a play is an infinite path, the winning condition hence is ...
متن کاملIterated Boolean Games
Iterated games are well-known in the game theory literature. We study iterated Boolean games. These are games in which players repeatedly choose truth values for Boolean variables they have control over. Our model of iterated Boolean games assumes that players have goals given by formulae of Linear Temporal Logic (LTL), a formalism for expressing properties of state sequences. In order to model...
متن کاملOn the logic of argumentation theory
The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows to import, for free, a wealth of new notions (e.g., argument equivalence), new techniques (e.g., calculi, model-checking games, bisimulation games), and results (e.g., completeness of calculi, adequacy of games, complexity of model-checking) from logic to argumentation.
متن کاملOptimization Complexity of Linear Logic Proof Games
A class of linear logic proof games is developed, each with a numeric score that depends on the number of preferred axioms used in a complete or partial proof tree. The complexity of these games is analyzed for the np-complete multiplicative fragment (mll) extended with additive constants and the pspace-complete multiplicative, additive fragment (mall) of propositional linear logic. In each cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000